Tight upper bounds for cell loss probabilitiesand required bandwidth estimation in
نویسندگان
چکیده
Estimating the cell loss probability in an ATM multiplexer is a key issue in network management and traac control tasks such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources. Based on this approximation, a simple algorithm is proposed to estimate accurately the aggregate required bandwidth to guarantee a given cell loss probability. Numerical results and comparisons to alternative approaches are also shown.
منابع مشابه
Tight Upper Bounds for Cell Loss Probabilities in ATM Multiplexers and Required Bandwidth Estimation
Estimating the cell loss probability in an ATM multi plexer is a key issue in network management and tra c control such as call admission control and bandwidth al location In this paper we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of hetero geneous on o sources with exponentially distributed on and o peri...
متن کاملTight Upper Bounds for Cell Loss Probabilities in ATM Multiplexersand Required
Estimating the cell loss probability in an ATM multi-plexer is a key issue in network management and traac control such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources with exponentially distributed on and oo pe...
متن کاملTight Upper Bounds for Cell Loss Probabilities in ATM
Estimating the cell loss probability in an ATM multi-plexer is a key issue in network management and traac control such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources with exponentially distributed on and oo pe...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملTighter Bounds for Structured Estimation
Large-margin structured estimation methods work by minimizing a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are not tight and sacrifice the ability to accurately model the true loss. We present tighter non-convex bounds based on generalizing the notion of a ramp loss from binary classification to structured estimation. ...
متن کامل